Algorithm 3. VND pseudocode.

Considering a randomly generated initial candidate solution s:

begin VND k ← 1;

while (k ≤ L) do s' ← apply k-bit local search from s Î N_k(s)

   if f(s') > f(s) then s = s'

k = 1 else k = k +1

   end if end while returns end VND